Quadratically optimized polynomials for fermion simulations

Quadratically optimized polynomials for fermion simulations

An algorithm for the computation of the coefficients and roots of quadratically optimized polynomials is described. An implementation in the algebraic manipulation language Maple is discussed. These polynomials can be used in local bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions.

DESY 97-132 Quadratically optimized polynomials for fermion simulations

Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these polynomials are described and their implementation in the algebraic manipulation language Maple is discussed. Tests of the evaluation of polynomials on dynamical f...

Least-squares optimized polynomials for fermion simulations

Least-squares optimized polynomials are discussed which are needed in the twostep multi-bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions. A recurrence scheme for the calculation of necessary coefficients in the recursion and for the evaluation of these polynomials is introduced.

DESY 99-170 Least-squares optimized polynomials for fermion simulations∗

Least-squares optimized polynomials are discussed which are needed in the twostep multi-bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions. A recurrence scheme for the calculation of necessary coefficients in the recursion and for the evaluation of these polynomials is introduced.

Multi - bosonic algorithms for dynamical fermion simulations ∗